Estimating Worst-case Resource Usage by Resource-usage-aware Fuzzing

نویسندگان

چکیده

Abstract Worst-case resource usage provides a useful guidance in the design, configuration and deployment of software, especially when it runs under context with limited amount resources. Static resource-bound analysis can provide sound upper bounds worst-case but may too conservative, even unbounded, results. In this paper, we present resource-usage-aware fuzzing approach to estimate usage. The key idea is guide process using resource-usage together relevant coverage. Moreover, leverage semantic patch make use static information (including control-flow, function-call, etc.) instrument original program, for sake aiding subsequent fuzzing. We have conducted experiments various resources real-world programs, including heap memory, stack depths, sockets, user-defined resources, etc. preliminary experimental results show promising ability our estimating compared two state-of-the-art tools (AFL MemLock).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Resource Usage Aware Backfilling

Job scheduling policies for HPC centers have been extensively studied in the last few years, especially backfilling based policies. Almost all of these studies have been done using simulation tools. All the existent simulators use the runtime (either estimated or real) provided in the workload as a basis of their simulations. In our previous work we analyzed the impact on system performance of ...

متن کامل

Resource Sharing Usage Aware Resource Selection Policies for Backfilling Strategies

Job scheduling policies for HPC centers have been extensively studied in the last few years, specially backfilling based policies. Almost all of these studies have been done using simulation tools. All the existent simulators use the runtime (either estimated or real) provided in the workload as a basis of their simulations. In our previous work we analyzed the impact on system performance of c...

متن کامل

Asymptotic Resource Usage Bounds

When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the program for large input data and make a rough approximation by considering as equivalent programs whose resource usage grows at the same rate. Motivated by the existence of non-asymptotic resource usage analyzers, in this pap...

متن کامل

Resource Usage Verification

We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time testing to verify that a program conforms to a resource usage policy specified by a deterministic finite state automata (DFA) which details allowed sequences of operations on resources. Our approach has four main phas...

متن کامل

A THEORETICALLY CORRECT RESOURCE USAGE VISUALIZATION FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM

The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-99429-7_5